Noise, physics, and non-Turing computation

نویسندگان

  • Sunny Bains
  • Jeffrey Johnson
چکیده

It has been proven that recurrent neural networks with analog weights can solve problems that are insoluble using Turing machines. However, the prevailing view of those involved in computing research is that a) nonTuring computation is unnecessary for intelligence and b) machines with non-Turing abilities cannot be built in practice. Two reasons are commonly cited for this. First, the effects of noise are said to remove any possibility of using an analog system to represent quantities with continuous infinite precision. Second, the (asserted) discrete nature of the Universe, is cited as proof that truly analog systems cannot exist. These are issues of physics that exist well outside the domain of computer science and engineering. Here, we will examine the technical and mathematical bases of these claims, suggest counter arguments, and discuss the deep physical questions that they raise.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

The Principle of Relativity: From Ungar’s Gyrolanguage for Physics to Weaving Computation in Mathematics

‎This paper extends the scope of algebraic computation based on a non standard $times$ to ‎the more basic case of a non standard $+$‎, ‎where standard means associative ‎and commutative‎. ‎Two physically meaningful examples of a non standard $+$ are ‎provided by the observation of motion in Special Relativity‎, ‎from either ‎outside (3D) or inside (2D or more)‎, ‎We revisit the ``gyro''-theory ...

متن کامل

Physically-relativized Church-Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics

We turn ‘the’ Church-Turing Hypothesis from an ambiguous source of sensational speculations into a (collection of) sound and well-defined scientific problem(s): Examining recent controversies, and causes for misunderstanding, concerning the state of the ChurchTuring Hypothesis (CTH), suggests to study the CTH relative to an arbitrary but specific physical theory—rather than vaguely referring to...

متن کامل

A Formalisation of Non-Finite Computation

Recent work in the field of relativitistic space-times suggests that it may be possible for a machine to perform an infinite number of operations in a finite time. Investigation of these machines has three motivations. First, because the machines may be physically possible, they have implications for the general question of what problems are theoretically solvable. Second, the physical laws tha...

متن کامل

The Physical Church-Turing Thesis and the Principles of Quantum Theory

Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands could breach the physical Church-Turing thesis [26, 25] We draw a clear line as to when this is the case, in a way that is inspired by Gandy [20]. Gandy formulates postulates about physics, such as homogeneity of space and time,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000